Accelerating Intercommunication in Highly Parallel Systems
نویسندگان
چکیده
منابع مشابه
Distributed Tuple Spaces in Highly Parallel Systems
The tuple space abstraction is widely recognized as a powerful and general coordination model for parallel programming. However, it is based on the abstraction of a global space and therefore difficult to be efficiently implemented in highly parallel architectures. The paper discusses the implementation issues of the tuple space abstraction on large parallel systems and proposes a new implement...
متن کاملProcess Management for Highly Parallel UNIX Systems
Despite early development exclusively on uniprocessors, a growing number of UNIX systems are now available for shared memory (MIMD) multiprocessors. While much of this trend has been driven by the general success of the UNIX interface as an emerging industry standard, experience has shown that the basic UNIX design is amenable to such environments. Relatively simple extensions such as shared me...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملMolecular intercommunication between the complement and coagulation systems.
The complement system as well as the coagulation system has fundamental clinical implications in the context of life-threatening tissue injury and inflammation. Associations between both cascades have been proposed, but the precise molecular mechanisms remain unknown. The current study reports multiple links for various factors of the coagulation and fibrinolysis cascades with the central compl...
متن کاملAccelerating MCMC via Parallel Predictive Prefetching
Parallel predictive prefetching is a new framework for accelerating a large class of widelyused Markov chain Monte Carlo (MCMC) algorithms. It speculatively evaluates many potential steps of an MCMC chain in parallel while exploiting fast, iterative approximations to the target density. This can accelerate sampling from target distributions in Bayesian inference problems. Our approach takes adv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2016
ISSN: 1544-3566,1544-3973
DOI: 10.1145/3005717